Perturbation of harmonic structures and an index-zero theorem
نویسندگان
چکیده
منابع مشابه
Zero-index structures as an alternative platform for quantum optics.
Vacuum fluctuations are one of the most distinctive aspects of quantum optics, being the trigger of multiple nonclassical phenomena. Thus, platforms like resonant cavities and photonic crystals that enable the inhibition and manipulation of vacuum fluctuations have been key to our ability to control light-matter interactions (e.g., the decay of quantum emitters). Here, we theoretically demonstr...
متن کاملZero modes of various graphene configurations from the index theorem
In this article we consider a graphene sheet that is folded in various compact geometries with arbitrary topology described by a certain genus, g. While the Hamiltonian of these systems is defined on a lattice one can take the continuous limit. The obtained Dirac-like Hamiltonian describes well the low energy modes of the initial system. Starting from first principles we derive an index theorem...
متن کاملOn Harmonic Index and Diameter of Unicyclic Graphs
The Harmonic index $ H(G) $ of a graph $ G $ is defined as the sum of the weights $ dfrac{2}{d(u)+d(v)} $ of all edges $ uv $ of $G$, where $d(u)$ denotes the degree of the vertex $u$ in $G$. In this work, we prove the conjecture $dfrac{H(G)}{D(G)} geq dfrac{1}{2}+dfrac{1}{3(n-1)} $ given by Jianxi Liu in 2013 when G is a unicyclic graph and give a better bound $ dfrac{H(G)}{D(G)}geq dfra...
متن کاملOn the harmonic index and harmonic polynomial of Caterpillars with diameter four
The harmonic index H(G) , of a graph G is defined as the sum of weights 2/(deg(u)+deg(v)) of all edges in E(G), where deg (u) denotes the degree of a vertex u in V(G). In this paper we define the harmonic polynomial of G. We present explicit formula for the values of harmonic polynomial for several families of specific graphs and we find the lower and upper bound for harmonic index in Caterpill...
متن کاملOn the harmonic index of bicyclic graphs
The harmonic index of a graph $G$, denoted by $H(G)$, is defined asthe sum of weights $2/[d(u)+d(v)]$ over all edges $uv$ of $G$, where$d(u)$ denotes the degree of a vertex $u$. Hu and Zhou [Y. Hu and X. Zhou, WSEAS Trans. Math. {bf 12} (2013) 716--726] proved that for any bicyclic graph $G$ of order $ngeq 4$, $H(G)le frac{n}{2}-frac{1}{15}$ and characterize all extremal bicyclic graphs.In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l’institut Fourier
سال: 1970
ISSN: 0373-0956
DOI: 10.5802/aif.344